REPEATED LOW-DENSITY BURST ERROR DETECTING CODES

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On repeated low-density burst error detecting linear codes

The paper presents lower and upper bounds on the number of parity-check digits required for a linear code that is capable of detecting repeated low-density burst errors of length b (fixed) with weight w or less (w ≤ b). A bound for codes which can correct and simultaneously detect such burst errors has also been derived. An illustration has been provided for the code detecting 2-repeated burst ...

متن کامل

Repeated Burst Error Detecting Linear Codes

This paper presents lower bounds on the number of paritycheck digits required for a linear code that is capable of detecting errors which are ‘m-repeated burst errors’. Further, codes capable of detecting and simultaneously correcting such errors have also been studied. ∗Corresponding author. Ratio Mathematica, 19, pp. 25-30

متن کامل

Blockwise Repeated Low - Density Burst Error Correcting Linear Codes

The paper presents necessary and sufficient condition on the number of parity-check digits required for the existence of a linear code capable of correcting errors in the form of 2-repeated low-density bursts occurring within a sub-block. An illustration of a code of length 24 correcting all 2-repeated low-density bursts of length 3 or less with weight 2 or less occurring within a sub-block of ...

متن کامل

REPEATED LOW - DENSITY BURST ERROR LOCATING CODES B . K . Dass and Surbhi Madan

This paper deals with derivation of bounds for linear codes which are able to detect and locate 2-repeated low-density burst errors occurring within a sub-block. An example of such a code has also been provided. 2000 Mathematics Subject Classification: 94B20, 94B65, 94B25.

متن کامل

Moderate-density Burst Error Correcting Linear Codes

It is well known that during the process of transmission errors occur predominantly in the form of a burst. However, it does not generally happen that all the digits inside any burst length get corrupted. Also when burst length is large then the actual number of errors inside the burst length is also not very less. Keeping this in view, we study codes which detect/correct moderate-density burst...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the Korean Mathematical Society

سال: 2011

ISSN: 0304-9914

DOI: 10.4134/jkms.2011.48.3.475